Occam's Razor in Metacompuation: the Notion of a Perfect Process Tree
نویسندگان
چکیده
We introduce the notion of a perfect process tree as a model for the full propagation of information in metacomputation. Starting with constant propagation we construct step-by-step the driving mechanism used in supercompila tion which ensures the perfect propagation of information. The concept of a simple supercompiler based on perfect driving coupled with a simple folding strategy is explained. As an example we demonstrate that specializing a naive pattern matcher with respect to a fixed pattern obtains the efficiency of a matcher generated by the Knuth, Morris & Pratt algorithm.
منابع مشابه
Occam’s Razor in Metacomputation: the Notion of a Perfect Process Tree
We introduce the notion of a perfect process tree as a model for the full propagation of in formation in metacomputation. Starting with constant propagation we construct step-by-step the driving mechanism used in supercompila tion which ensures the perfect propagation of information. The concept of a simple supercompiler based on perfect driving coupled with a simple folding strategy is explain...
متن کاملOccam's Razor and a Non-Syntactic Measure of Decision Tree Complexity
Occam's razor, attributed to the fourteenth century English philosopher William of Occam, states: “plurality should not be assumed without necessity.” The machine learning interpretation of Occam’s razor is that if two models have the same performance on the training set, choose the simpler. Decision tree learning widely uses Occam’s razor. Popular decision tree generating algorithms are based ...
متن کاملCombinatorial views on persistent characters in phylogenetics
The so-called binary perfect phylogeny with persistent characters has recently been thoroughly studied in computational biology as it is less restrictive than the well known binary perfect phylogeny. Here, we focus on the notion of (binary) persistent characters, i.e. characters that can be realized on a phylogenetic tree by at most one 0 → 1 transition followed by at most one 1 → 0 transition ...
متن کاملComplexity Approximation Principle
We propose a new inductive principle, which we call the complexity approximation principle (CAP). This principle is a natural generalization of Rissanen’s minimum description length (MDL) principle and Wallace’s minimum message length (MML) principle and is based on the notion of predictive complexity, a recent generalization of Kolmogorov complexity. Like the MDL principle, CAP can be regarded...
متن کاملModeling dependency in adaptation of acoustic models using multiscale tree processes
To adapt the large number of parameters in a speech recognition acoustic model with a small amount of data, some notion of parameter dependence is needed. We present a dependence model to relate parameters in a parsimonious framework using a Gaussian multiscale process de ned by the evolution of a linear stochastic dynamical system on a tree. To adapt all classes from all adaptation data, we fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993